/*
 * Problem:
 * Given a binary tree, find its maximum depth.
 * 给定一棵二叉树，找出它的最大深度
 * The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
 * 最大深度是从根节点向下到最远的叶节点所经过的最长路径的结点的数量。
 * 
 * Example:
 * Given a binary tree as follow:
 *   1
 *  / \ 
 * 2   3
 *    / \
 *   4   5
 * The maximum depth is 3
 * 
 * Challenge:
 * Rotate in-place with O(1) extra memory.
 * 在O(1)的空间复杂度内旋转字符串
 */
package me.yobol.lintcode.easy.maxdepth;

import me.yobol.lintcode.TreeNode;

/**
 *
 * @author Yobol
 */
public interface IMaxDepth {
    public int maxDepth(TreeNode root);
}
